Knowledge-based Solutions as They Apply to the General Radar Problem
نویسنده
چکیده
This tutorial provides an introduction to the application of knowledge-based processing to the general radar problem. We interpret knowledge-based processing as the use of adaptivity and the exploitation of prior knowledge in such a way as to choose the optimum processing method in each case, and we interpret the general radar problem as the detection, classification and tracking of targets against a background of clutter and interference. As such the tutorial attempts to describe the nature of the general radar problem and the basic processing techniques that are used, and to show why knowledge-based signal processing may be advantageous, setting the scene for the subsequent tutorials covering CFAR detection, space-time adaptive processing, tracking, and emerging technologies. The fundamental concepts of matched filtering, superresolution and adaptive filtering are described, emphasizing the equivalence of time/frequency and aperture/angular domains, and introducing the concept of Space-Time Adaptive Processing. A description is given of some of the statistical clutter models in common use (Rayleigh, Ricean, Lognormal, Weibull and Compound-K), with practical examples of sea clutter and of land clutter which demonstrate that clutter is in general non-Gaussian and non-stationary, both in time and space. Two examples are given of the application of adaptive techniques to the suppression on nonhomogeneous clutter, showing that the performance of the adaptive Doppler filtering algorithm is severely compromised at clutter edges, due to incorrect estimation of the clutter covariance matrix, and how in Space-Time Adaptive Processing a nonhomogeneity detector can be used in the choice of the most appropriate STAP algorithm, forming the socalled Knowledge-Based STAP (KB-STAP) processor.
منابع مشابه
Simulation-Based Radar Detection Methods
In this paper, radar detection based on Monte Carlo sampling is studied. Two detectors based on Importance Sampling are presented. In these detectors, called Particle Detector, the approximated likelihood ratio is calculated by Monte Carlo sampling. In the first detector, the unknown parameters are first estimated and are substituted in the likelihood ratio (like the GLRT method). In the sec...
متن کاملSimulation-Based Radar Detection Methods
In this paper, radar detection based on Monte Carlo sampling is studied. Two detectors based on Importance Sampling are presented. In these detectors, called Particle Detector, the approximated likelihood ratio is calculated by Monte Carlo sampling. In the first detector, the unknown parameters are first estimated and are substituted in the likelihood ratio (like 
the GLRT method). In the s...
متن کاملنظریۀ شایستگیهای کانونی: الگویی برای برنامهریزی آموزش علم اطلاعات و دانششناسی
Purpose: The aim of this study was to evaluate competency-based training concepts, introduce core competencies and to apply these concepts as a conceptual model for knowledge and information science education in Iran. Methodology: This research conducted with the documentary-analytical method. The literature review on the competencies of the required specialties in knowledge and information ...
متن کاملAutomatic Interpretation of UltraCam Imagery by Combination of Support Vector Machine and Knowledge-based Systems
With the development of digital sensors, an increasing number of high-resolution images are available. Interpretation of these images is not possible manually, which necessitates seeking for practical, fast and automatic solutions to solve the environmental and location-based management problems. The land cover classification using high-resolution imagery is a difficult process because of the c...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کامل